Developing Effective Service Policies for Multiclass Queues with Abandonment: Asymptotic Optimality and Approximate Policy Improvement
نویسندگان
چکیده
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print or online or to submit the papers to another publication.
منابع مشابه
Problems of Adaptive Optimization In Multiclass M/GI/1 Queues with Bernoulli Feedback
Adaptive algorithms are obtained for the solution of separable optimization problems in multiclass M/GI/1 queues with Bernoulli feedback. Optimality of the algorithms is established by modifying and extending methods of stochastic approximation. These algorithms, can be used as a basis for designing policies for semi-separable and approximate lexicographic optimization problems and in the case ...
متن کاملStability of multiclass queueing networks under longest-queue and longest-dominating-queue scheduling
We consider the stability of robust scheduling policies for multiclass queueing networks. These are open networks with arbitrary routing matrix and several disjoint groups of queues in which at most one queue can be served at a time. The arrival and potential service processes and routing decisions at the queues are independent, stationary and ergodic. A scheduling policy is called robust if it...
متن کاملErgodic control of multiclass multi-pool networks in the Halfin-Whitt regime: asymptotic optimality results
In [Ann. Appl. Probab. 14 (2016) 3110–3153] we studied unconstrained and constrained ergodic control problems for the limiting diffusion of multiclass multi-pool networks in the Halfin– Whitt (H–W) regime, and developed a leaf elimination algorithm to obtain an explicit expression for the drift. This paper continues the study of ergodic control problems for such networks, focusing on proving as...
متن کاملScheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network
We consider the problem of finding an optimal dynamic priority sequencing policy to maximize the mean throughput rate in a multistation, multiclass closed queueing network with general service time distributions and a general routing structure. Under balanced heavy loading conditions, this scheduling problem can be approximated by a control problem involving Brownian motion. Although a unique, ...
متن کاملDynamic Server Assignment in Multiclass Queues with Shifts, with Application to Nurse Staffing in Emergency Departments
Many service systems are staffed by workers who work in shifts. In this work, we study the dynamic assignment of servers to different areas of a service system at the beginning of discrete time-intervals, i.e., shifts. The ability to reassign servers at discrete intervals introduces a partial flexibility (as opposed to full flexibility under continuous reassignment) that provides an opportunity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- INFORMS Journal on Computing
دوره 28 شماره
صفحات -
تاریخ انتشار 2016